Subexponential Interval Graphs Generated by Immigration-death Processes Subexponential Interval Graphs Generated by Immigration-death Processes

نویسندگان

  • Naoto Miyoshi
  • Mariko Ogura
  • Takeya Shigezumi
  • Ryuhei Uehara
چکیده

Scale-free graphs have recently attracted much attention since so-called scale-free phenomena have really appeared in various physical and social networks, where a graph is said to be scale-free if the distribution of degrees has a power-law tail. In the previous paper, the authors proposed a simple model of random interval graphs generated by immigration-death processes (also known as M/G/∞ queueing processes) and showed that, when the interval lengths follow a power-law distribution, the generated interval graph is scale-free in the steady state. In this paper, we generalize this result to the model where the distribution of interval lengths is subexponential and provide a condition under which the stationary degree distribution is also subexponential. Furthermore, we consider the conditional expectation of the cluster coefficient of a vertex given its degree and derive its limit as the degree goes to infinity under the same condition as that for obtaining the tail asymptotics of the degree distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subexponential Algorithms for Partial Cover Problems

Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) the maximum number of edges (or vertices) using a given number (k) of vertices, rather than covering all edges (or vertices). In general graphs, these problems are hard for parameterized complexity classes when paramet...

متن کامل

Bidimensionality and geometric graphs

Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has been sucessfully applied to yield subexponential time parameterized algorithms, EPTASs and linear kernels for many problems on families of graphs excluding a fixed graph H as a minor. In this paper we use several of th...

متن کامل

Quantum Graphs II: Some spectral properties of quantum and combinatorial graphs

The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and other areas. A Schnol type theorem is proven that allows one to detect that a point λ belongs to the spectrum when a generalized eigenfunction with an subexpo...

متن کامل

Optimality Program in Segment and String Graphs

Planar graphs are known to allow subexponential algorithms running in time 2O( √ n) or 2O( √ n logn) for most of the paradigmatic problems, while the brute-force time 2Θ(n) is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in 2O(n logn) by Fox and Pach [SODA’11], we investigate which problems have subexponential algorithms on the intersection g...

متن کامل

$H$-colouring $P_t$-free graphs in subexponential time

A graph is called Pt-free if it does not contain the path on t vertices as an induced subgraph. Let H be a multigraph with the property that any two distinct vertices share at most one common neighbour. In this note, we show that for any α > 1 − ⌊t/2⌋−1 the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time O ( 2|V (G)| α) in the class of Pt-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008